Travelling salesman problem - PDFSEARCH.IO - Document Search Engine

Travelling salesman problem
Results: 321

#	Item
11	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: comopt.ifi.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
12	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
13	System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1]. Add to Reading List Source URL: cpcc.berkeley.edu Language: English - Date: 2016-06-12 17:08:37 Mathematics Discrete mathematics Combinatorics Operations research Travelling salesman problem TSP Partition Polling system
14	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
15	What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw Add to Reading List Source URL: www.optimization-online.org Language: English - Date: 2015-05-04 12:28:03 Operations research Heuristics Mathematics Mathematical optimization Cognition Applied mathematics Search algorithms Hyper-heuristic Travelling salesman problem Genetic algorithm Algorithm Local search
16	107 Documenta Math. A Brief History of Linear and Mixed-Integer Programming Computation Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:24:47 Operations research Mathematical optimization Mathematics Numerical analysis Linear programming CPLEX Algorithm Simplex algorithm Simplex Integer programming MPS Travelling salesman problem
17	199 Documenta Math. Flinders Petrie, the Travelling Salesman Problem, and the Beginning of Mathematical Modeling Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-29 04:14:08 Archaeology Humanities Coding theory Computer arithmetic Error detection and correction Dating methodologies in archaeology Predynastic Egypt Flinders Petrie Seriation Naqada culture Typology Travelling salesman problem
18	CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-26 12:53:21 Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem
19	Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India, Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-12-11 12:58:32 Graph theory Computational complexity theory Mathematics NP-complete problems Spanning tree Steiner tree problem Operations research Knowledge representation Edsger W. Dijkstra Minimum spanning tree Travelling salesman problem Approximation algorithm
20	CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224 Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2012-03-26 04:52:47 Graph theory Mathematics Computational complexity theory NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Cycle Seven Bridges of Knigsberg Path NP-completeness Shortest path problem

UPDATE